Higher Order Abstract Interpretation with Flow-Effect Types

This paper describes a novel flow-effect type system that combines concepts of type constraint systems and type effect systems, to achieve a flow-sensitive abstract interpretation of programs with higher-order functions. We prove that a decidable, safe closure algorithm exists. Deriving a decidable type closure algorithm in the presence of higher-order recursive functions is the main technical achievement of the paper.